Network of M/M/1 Cyclic Polling Systems
نویسندگان
چکیده
This paper presents a Network of Cyclic Polling Systems that consists of two cyclic polling systems with two queues each when transfer of users from one system to the other is imposed. This system is modelled in discrete time. It is assumed that each system has exponential inter-arrival times and the servers apply an exhaustive policy. Closed form expressions are obtained for the first and second moments of the queue’s lengths for any time.
منابع مشابه
Approximate Method to Study M/G/1-Type Polling System with Adaptive Polling Mechanism
Abstract: We investigate a polling model of a radio-cell of the broadband wireless IEEE 802.11 network. A radio-cell is assumed to work in the ‘‘data collection’’ regime. It is modeled by a polling system with N queues and a single server polling the queues in a cyclic adaptive order. Under adaptive scheme, the server (base station) skips (does not visit) the queues (subscriber stations) which ...
متن کاملPolling with a General-Service Order Table
This paper derives exact results for a polling system such as a token bus or token ring with exhaustive service and priority polling. The results can also be used to analyze a terminal controller with a general-service order table. There are N stations in the system and the token is passed among them according to a polling table of length M (>N). Stations are given higher priority by being list...
متن کاملScheduling in polling systems
We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling system...
متن کاملPolling models with renewal arrivals: A new method to derive heavy-traffic asymptotics
We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-time distributions, zero switch-over times, gated service at each queue, and with general renewal arrival processes at each of the queues. For this classical model, we propose a new method to derive closed-form expressions for the expected delay at each of the queues when the load tends to 1, under...
متن کاملTowards a unifying theory on branching-type polling systems in heavy traffic
For a broad class of polling models the evolution of the system at specific embedded polling instants is known to constitute a multi-type branching process (MTBP) with immigration. In this paper it is shown that for this class of polling models the vector that describes the state of the system at these polling instants, say X = (X1, . . . ,XM), satisfies the following heavy-traffic behavior (un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017